A “fast growth” method of computing free energy differences
نویسندگان
چکیده
Let ∆F be the free energy difference between two equilibrium states of a system. An established method of numerically computing ∆F involves a single, long “switching simulation”, during which the system is driven reversibly from one state to the other (slow growth, or adiabatic switching). Here we study a method of obtaining the same result from numerous independent, irreversible simulations of much shorter duration (fast growth). We illustrate the fast growth method, computing the excess chemical potential of a Lennard-Jones fluid as a test case, and we examine the performance of fast growth as a practical computational tool.
منابع مشابه
A Fast Method for Calculation of Transformers Leakage Reactance Using Energy Technique
Energy technique procedure for computing the leakage reactance in transformers is presented. This method is very efficient compared with the use of flux element and image technique and is also remarkably accurate. Examples of calculated leakage inductances and the short circuit impedance are given for illustration. For validation, the results are compared with the results obtained using practic...
متن کاملA Mobile and Fog-based Computing Method to Execute Smart Device Applications in a Secure Environment
With the rapid growth of smart device and Internet of things applications, the volume of communication and data in networks have increased. Due to the network lag and massive demands, centralized and traditional cloud computing architecture are not accountable to the high users' demands and not proper for execution of delay-sensitive and real time applications. To resolve these challenges, we p...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملParallel AFMPB solver with automatic surface meshing for calculation of molecular solvation free energy
We present PAFMPB, an updated and parallel version of the AFMPB software package for fast calculation of molecular solvation-free energy. The new version has the following new features: (1) The adaptive fast multipole method and the boundary element methods are parallelized; (2) A tool is embedded for automatic molecular VDW/SAS surface mesh generation, leaving the requirement for a mesh file a...
متن کامل